Is Timed Branching Bisimilarity an Equivalence Indeed?
نویسندگان
چکیده
We show that timed branching bisimilarity as defined by van der Zwaag [14] and Baeten & Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, van der Zwaag’s definition and our adaptation coincide.
منابع مشابه
Is Timed Branching Bisimilarity a Congruence Indeed?
We show that timed branching bisimilarity as defined by Van der Zwaag [17] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on Van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, Van der Zwaag’s defi...
متن کاملBranching Bisimilarity is an Equivalence Indeed!
This note presents a detailed proof of a result in the theory of concurrency semantics that is already considered folklore, namely that branching bisimilarity is an equivalence relation. The \simple proof," which in the literature is always assumed to exist, is shown to be incorrect. The proof in this note is based on the notion of a semi-branching bisimulation taken from [10]. Branching bisimi...
متن کاملBranching bisimulation for probabilistic systems: Characteristics and decidability
We address the concept of abstraction in the setting of probabilistic reactive systems, and study its formal underpinnings for the strictly alternating model of Hansson. In particular, we define the notion of branching bisimilarity and study its properties by studying two other equivalence relations, viz. coloured trace equivalence and branching bisimilarity using maximal probabilities. We show...
متن کاملBranching bisimulation equivalence with explicit divergence
We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with untiland divergence modalities.
متن کاملThe State Explosion Problem from Trace to Bisimulation Equivalence
We show that any relation between the simulation preorder and bisimilarity is EXPTIME-hard when systems are given as networks of nite state systems (or equivalently as automata with boolean variables , etc.). We also show that any relation between trace inclusion and ready trace equivalence or possible-futures equivalence is EXPSPACE-hard for these systems. These results match the already known...
متن کامل